A new graph parameter related to bounded rank positive semidefinite matrix completions
نویسندگان
چکیده
منابع مشابه
A new graph parameter related to bounded rank positive semidefinite matrix completions
The Gram dimension gd(G) of a graph G is the smallest integer k ≥ 1 such that any partial real symmetric matrix, whose entries are specified on the diagonal and at the off-diagonal positions corresponding to edges of G, can be completed to a positive semidefinite matrix of rank at most k (assuming a positive semidefinite completion exists). For any fixed k the class of graphs satisfying gd(G) ≤...
متن کاملPositive Semidefinite Rank-based Correlation Matrix Estimation with Application to Semiparametric Graph Estimation.
Many statistical methods gain robustness and flexibility by sacrificing convenient computational structures. In this paper, we illustrate this fundamental tradeoff by studying a semi-parametric graph estimation problem in high dimensions. We explain how novel computational techniques help to solve this type of problem. In particular, we propose a nonparanormal neighborhood pursuit algorithm to ...
متن کاملPositive Semidefinite Matrix Completions on Chordal Graphs and Constraint Nondegeneracy in Semidefinite Programming
Let G = (V, E) be a graph. In matrix completion theory, it is known that the following two conditions are equivalent: (i) G is a chordal graph; (ii) Every G-partial positive semidefinite matrix has a positive semidefinite matrix completion. In this paper, we relate these two conditions to constraint nondegeneracy condition in semidefinite programming and prove that they are each equivalent to (...
متن کاملCompletely Positive Semidefinite Rank
An n×n matrix X is called completely positive semidefinite (cpsd) if there exist d×d Hermitian positive semidefinite matrices {Pi}i=1 (for some d ≥ 1) such that Xij = Tr(PiPj), for all i, j ∈ {1, . . . , n}. The cpsd-rank of a cpsd matrix is the smallest d ≥ 1 for which such a representation is possible. In this work we initiate the study of the cpsd-rank which we motivate twofold. First, the c...
متن کاملPositive semidefinite rank
The positive semidefinite (psd) rank of a nonnegative real matrix M is the smallest integer k for which it is possible to find psd matrices Ai assigned to the rows of M and Bj assigned to the columns of M , of size k ˆ k, such that pi, jq-entry of M is the inner product of Ai and Bj . This is an example of a cone rank of a nonnegative matrix similar to nonnegative rank, and was introduced for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2013
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-013-0648-x